Model Pembelajaran Bamboo Dancing dengan Pendekatan CTL
نویسندگان
چکیده
AbstrakTujuan dari penelitian untuk mengetahui rata-rata hasil belajar matematika siswa yang diperoleh melalui model pembelajaran bamboo dancing menggunakan pendekatan CTL lebih baik pada dancing. Populasi dalam ini adalah seluruh kelas VIII MTs Islamiyah Sukoharjo. Instrumen berupa tes uraian. Analisis data uji-t dengan prasyarat uji normalitas dan homogenitas. Berdasarkan analisis disimpulkan bahwa tanpa CTL. Kata kunci :bangun ruang sisi datar,bamboo dancing,
منابع مشابه
Model Checking Ctl Is
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the use of temporal modalities or the use of negations—restrictions already studied for LTL by Sistla and Clarke (1985) and Markey (2004). For all these fragments, except for the trivial case without any temporal operator...
متن کاملOCL meets CTL: Towards CTL-Extended OCL Model Checking
In software modeling, the Object Constraint Language (OCL) is an important tool to specify properties that a model has to satisfy. The design of OCL reflects the structure of MOF-based modeling languages like UML and the tight integration results in an intuitive usability. However, OCL allows to express properties in the context of the current state of an instance model only but not with respec...
متن کاملReducing Model Checking from Multi-valued Ctl to Ctl
A multi-valued version of CTL (mv-CTL), where both the propositions and the accessibility relation are multi-valued taking values in a nite quasi-boolean algebra, is considered. A general translation from mv-CTL to CTL model checking is deened. An application of the translation is shown for the most commonly used quasi-boolean algebras.
متن کاملImplementing a CTL Model checker
This paper discusses the implementation of a branching time temporal logic CTL model checker for the PROD Pr/T-Net Reachability analysis tool. A new algorithm for model checking CTL is presented. This algorithm doesn't need the converse of the transition relation as the EMC algorithm does 4]. The algorithm also provides a counterexample and witness facility using one-pass reachabil-ity graph tr...
متن کاملCTL Model Checking for SPIN
We describe an e cient CTL model checking algorithm based on alternating automata and games. A CTL formula, expressing a correctness property, is rst translated to a hesitant alternating automaton and then composed with a Kripke structure representing the model to be checked, this resulting automaton is then checked for nonemptiness. We introduce the nonemptiness game that checks the nonemptine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal E-DuMath
سال: 2021
ISSN: ['2356-2064', '2356-2056']
DOI: https://doi.org/10.52657/je.v7i1.1336